Processing games with restricted capacities
نویسندگان
چکیده
منابع مشابه
Nonlocal games with restricted strategies
Entanglement plays a central role in quantum information processing and is an essential resource for classical distributed tasks such as unconditionally secure cryptography [Eke91], randomness certification [Col06, PAM+10] and expansion [VV12, CY13] and others. Hence, given such a distributed task one is interested in understanding what is the optimal entangled strategy and how much and what ki...
متن کاملGames and Capacities on Partitions
We consider capacities and games whose value v(S) depend on the organization of N \ S, this organization being represented by a partition. Hence we deal with capacities and games depending on two arguments: a subset (coalition) S and a partition π containing S. We call embedded coalition any such pair (S, π). We first provide a suitable structure for the set of embedded coalitions, study its pr...
متن کاملk-Balanced games and capacities
In this paper we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of k-additivity, we define the so-called k-balanced games and the corresponding generalization of core, the k-additive core, whose elements are not directly imputations b...
متن کاملThe prenucleolus for games with restricted cooperation
A game with a restricted cooperation is a triple (N, v,Ω), where N is a finite set of players, Ω ⊂ 2 , N ∈ Ω is a collection of feasible coalitions, v : Ω→ R is a characteristic function. The definition implies that if Ω = 2 , then the game (N, v,Ω) = (N, v) is the classical TU cooperative game. The class of all games with a restricted cooperation G with an arbitrary universal set of players is...
متن کاملHedonic Games with Graph-restricted Communication
We study hedonic coalition formation games in which cooperation among the players is restricted by a graph structure: a subset of players can form a coalition if and only if they are connected in the given graph. We investigate the complexity of finding stable outcomes in such games, for several notions of stability. In particular, we provide an efficient algorithm that finds an individually st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2009.06.014